Constrained locating arrays for combinatorial interaction testing
نویسندگان
چکیده
This paper introduces the notion of Constrained Locating Arrays (CLAs), mathematical objects which can be used for fault localization in a testing process for information systems. CLAs extend ordinary locating arrays to make them applicable to testing of systems that have constraints on test parameters. Such constraints are common in real-world systems; thus CLA enhances the applicability of locating arrays to practical testing problems.
منابع مشابه
Profiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملLocating and Detecting Arrays for Interaction Faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a valuable step in screening a system for interaction faults prior to its release, it provides little information to assist in the correction of such faults. Consequently tests to reveal the location of interaction faults ...
متن کاملLocating one pairwise interaction : Three recursive constructions ∗
In a complex component-based system, choices (levels) for components (factors) may interact to cause faults in the system behaviour. When faults may be caused by interactions among few factors at specific levels, covering arrays provide a combinatorial test suite for discovering the presence of faults. While well studied, covering arrays do not enable one to determine the specific levels of fac...
متن کاملTowards Unified Combinatorial Interaction Testing
We believe that we can exploit the benefits of combinatorial interaction testing (CIT) on many “non-traditional” combinatorial spaces using many “non-traditional” coverage criteria. However, this requires truly flexible CIT approaches. To this end, we introduce Unified Combinatorial Interaction Testing (U-CIT), which enables practitioners to define their own combinatorial spaces and coverage cr...
متن کاملCombinatorial Aspects of Covering Arrays
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requiring that the appearance of t-tuples be balanced. Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1801.06041 شماره
صفحات -
تاریخ انتشار 2017